Efficient computation of densely sampled wavelet transforms
نویسندگان
چکیده
An efficient algorithm is presented for computing the continuous wavelet transform and the wideband ambiguity function on a sample grid with uniform time spacing but arbitrary sampling in scale. The method is based on the chirp z-transform and requires the same order of computation as constant-bandwidth analysis techniques, such as the short-time Fourier transform and the narrowband ambiguity function. An alternative spline approximation method which is more efficient when the number of scale samples is large is also described.
منابع مشابه
Fast algorithms for discrete and continuous wavelet transforms
Several algorithms are reviewed for computing various types of wavelet transforms: the Mallat algorithm, the “a trous” algorithm and their generalizations by Shensa. The goal is 1) to develop guidelines for implementing discrete and continuous wavelet transforms efficiently, 2) to compare the various algorithms obtained and give an idea of possible gains by providing operation counts. The compu...
متن کاملClassical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملEfficient Quantum Transforms
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a generalized Kronecker product is given. Applications include re-development of the networks for computing the Walsh-Hadamard and the quantum Fourier transform...
متن کاملFast Algorithms for Running Wavelet Analyses
We present a general framework for the design and efficient implementation of various types of running (or over-sampled) wavelet transforms (RWT) using polynomial splines. Unlike previous techniques, the proposed algorithms are not necessarily restricted to scales that are powers of two; yet they all achieve the lowest possible complexity : 0(N) per scale, where N is signal length. In particula...
متن کاملAI Based Low complexity VLSI Architectures for 2D Daubechies Wavelet Filters for DSP Applications
The field of separate rippling transforms has been attracting substantial interest partially as a result of the rippling analysis being capable of modeling an indication into a specific set of basic functions equipped with sensible spectral properties. Rippling analysis has been accustomed observe system non-linearities by creating use of its localization feature. DWT-based multi-resolution ana...
متن کامل